منابع مشابه
Polygraphs of finite derivation type
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, whic...
متن کاملHomological Finite Derivation Type
In 1987 Squier defined the notion of finite derivation type for a finitely presented monoid. To do this, he associated a 2-complex to the presentation. The monoid then has finite derivation type if, modulo the action of the free monoid ring, the 1-dimensional homotopy of this complex is finitely generated. Cremanns and Otto showed that finite derivation type implies the homological finiteness c...
متن کاملFinite derivation type for Rees matrix semigroups
This paper introduces the topological finiteness condition finite derivation type (FDT) on the class of semigroups. This notion is naturally extended from the monoid case. With this new concept we are able to prove that if a Rees matrix semigroupM[S; I, J ;P ] has FDT then the semigroup S also has FDT. Given a monoid S and a finitely presented Rees matrix semigroup M[S; I, J ;P ] we prove that ...
متن کاملFinite Derivation Type for Large Ideals
In this paper we give a partial answer to the following question: does a large subsemigroup of a semigroup S with the finite combinatorial property finite derivation type (FDT ) also has the same property? A positive answer is given for large ideals. As a consequence of this statement we prove that, given a finitely presented Rees matrix semigroup M [S; I, J ;P ], the semigroup S has FDT if and...
متن کاملHigher-dimensional categories with finite derivation type
We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalising the one introduced by Squier for word rewriting systems. We characterise this property by using the notion of critical branching. In particular, we define sufficient conditions f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2016
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129516000220